Holographic representation: Hologram plane vs. object plane
نویسندگان
چکیده
منابع مشابه
Calculation for computer generated hologram using ray-sampling plane.
We introduce a new algorithm for calculating computer generated hologram (CGH) using ray-sampling (RS) plane. RS plane is set at near the object and the light-rays emitted by the object are sampled at the plane. Then the light-rays are transformed into the wavefront with using the Fourier transforms. The wavefront on the CGH plane is calculated by wavefront propagation simulation from RS plane ...
متن کاملPlane 1 Plane 2 Plane 1 Plane
This paper introduces a Relative Mapping Algorithm. This algorithm presents a new way of looking at the SLAM problem that does not use Probability, Iterative Closest Point, or Scan Matching techniques. A map of landmarks is generated by using the average relative location difference between landmarks. This means the algorithm does not use any known, estimated or predicted movement or position d...
متن کاملultrasound-guided out-of-plane vs. in-plane interscalene catheters: a randomized, prospective study
objectives to compare an out-of-plane interscalene catheter technique to the in-plane technique in a randomized clinical trial. patients and methods eighty-four patients undergoing open shoulder surgery were randomized to either the in-plane or out-of-plane ultrasound-guided continuous interscalene technique. the primary outcome was vas pain rating at 24 hours. secondary outcomes included pain ...
متن کاملVaried line spacing plane holographic grating recorded by using uniform line spacing plane gratings.
Uniform line spacing plane gratings are introduced into a recording system to generate aspherical wavefronts for recording varied line spacing plane holographic gratings. Analytical expressions of groove parameters are derived to the fourth order. A ray-tracing validation algorithm is provided based on Fermat's principle and a local search method. The recording parameters are optimized to recor...
متن کامل3 Analyzing the Plane vs Point Test
Having seen a probabilistic verifier for linearity of Boolean functions, we now move on to the goal of general low degree testing. Let us restate what we wish to show: Theorem 1 (Low Degree Testing). There are constants δ, γ, γ′ > 0, such that given the table of a function f : Fm → F and a degree d ≤ δ |F|, there is a probabilistic verifier for the statement “deg f ≤ d”. The verifier is given a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing: Image Communication
سال: 2018
ISSN: 0923-5965
DOI: 10.1016/j.image.2018.08.006